Discrete Algorithms for Mobile and Wireless Networks Lecture 23 : Thursday , 12 th April 2007 Instructor : Soma Chaudhuri Scribe : Puviyarasan Pandian
نویسنده
چکیده
With large-scale wireless networks, the associated challenges of self-configuration of the network , self-healing in the case of any failure and self-maintenance assume significant importance. Without even one these features, the sensor network formed cannot be used any further. A possible solution to this problem is to use clustering of the nodes in the network. A geographical-radius based clustering has several advantages. 1. The network structure obtained by clustering is independent of the number of nodes in the network. 2. Efficient communication is possible within the geographical region, which is very essential for energy consumption in wireless sensor networks. 3. Efficient evaluation of spatial queries, which is normally the case with wireless sensor networks, as we discussed in the class. A lot of research has gone into the problem of clustering in static networks. The problem of clustering in wireless sensor networks presents us several more challenges to address, which are as follows:
منابع مشابه
Discrete Algorithms for Mobile and Wireless Networks Lecture 12 : Thursday , 22 nd February 2007 Instructor : Soma Chaudhuri Scribe : Aaron Sterling
This class period focused on a theoretical application of collision-detectors to solve the consensus problem; and the implementation of replicated state machines, to produce fault-tolerant wireless networks. We reviewed two papers: “Consensus and Collision Detectors in Wireless Ad Hoc Networks” by G. Chockler, M. Demirbas and S. Gilbert; and “Replicated State Machines” by G. Chockler and S. Gil...
متن کامل2007 Instructor : Soma Chaudhuri Scribe : Puviyarasan Pandian
In the last lecture, we discussed Reference Broadcast Synchronization, a mechanism which addresses the problem of energy-frugal μ-second precision time synchronization. The method involved synchronization between receivers based on the arrival time of a reference broadcast. The algorithm was extended to work on multiple domains as well, where nodes not in the same broadcast domain achieve this ...
متن کاملDiscrete Algorithms for Mobile and Wireless Networks Lecture 10 : Part A : Thursday Feb 15 th , 07 Instructor : Soma
Recent research envisions wireless sensor networks as collections of tiny, autonomous devices with computation, sensing and communication capabilities. Various implementations of such so-called sensor motes exist and networks of different scales have been deployed. There has been active research both on theory and algorithms and on software architectures. Although many classical distributed res...
متن کاملDiscrete Algorithms for Mobile and Wireless Networks Lecture 2 : Thursday , 18 th January 2007 Instructor :
متن کامل
Discrete Algorithms for Mobile and Wireless Networks Lecture 7 Part B : Tuesday , 6 th February 2007
Time synchronization is essential in distributed systems and the Network Time protocol is used for this purpose across systems in the Internet. In wireless sensor networks and actuators, the precision requirement for time synchronization is in the order of μ-seconds. Various applications of these networks like some domain specific applications such as measurement of time-of-sound, forming a low...
متن کامل